On the Maximum Number of Sensor Decision Bits Needed
نویسندگان
چکیده
Distributed multisensor detection problems with quantized observation data are investigated for cases of nonbinary hypotheses. The observations available at each sensor are quantized to produce a multiple-bit sensor decision which is sent to a fusion center. At the fusion center, the quantized data are combined to form a nal decision using a predetermined fusion rule. Firstly, it is demonstrated that there is a maximum number of bits which should be used to communicate the sensor decision from a given sensor to the fusion center. This maximum is based on the number of bits used to communicate the decisions from all the other sensors to the fusion center. If more than this maximum number of bits is used, the performance of the optimum scheme will not be improved. Then in some special cases of great interest, the bound on the number of bits that should be used can be made signii-cantly smaller. Finally, the optimum way to distributed a xed number of bits across the sensor decisions is described for two-sensor cases. Illustrative numerical examples are presented at the end of this paper.
منابع مشابه
On the optimality of finite-level quantizations for distributed signal detection
Distributed multisensor detection problems with quantized observation data are investigated for cases of nonbinary hypotheses. The observations available at each sensor are quantized to produce a multiple-bit sensor decision which is sent to a fusion center. At the fusion center, the quantized data are combined to form a nal decision using a predetermined fusion rule. Firstly, the necessary con...
متن کاملDesign and Simulation of a Modified 32-bit ROM-based Direct Digital Frequency Synthesizer on FPGA
This paper presents a modified 32-bit ROM-based Direct Digital Frequency Synthesizer (DDFS). Maximum output frequency of the DDFS is limited by the structure of the accumulator used in the DDFS architecture. The hierarchical pipeline accumulator (HPA) presented in this paper has less propagation delay time rather than the conventional structures. Therefore, it results in both higher maximum ope...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملUnexpected properties and optimum-distributed sensor detectors for dependent observation cases
Optimum distributed signal detection system design is studied for cases with statistically dependent observations from sensor to sensor. The common parallel architecture is assumed. Here each sensor sends a decision to a fusion center which determines a nal binary decision using a non-randomized fusion rule. General L sensor cases are considered. A discretized iterative algorithm is suggested w...
متن کاملOn the Decisional Complexity of Problems Over the Reals
We consider the role of randomness for the decisional complexity in algebraic decision (or computation) trees, i.e. the number of comparisons ignoring all other computation. Recently Ting and Yao showed that the problem of finding the maximum of n elements has decisional complexity O(log2 n). In contrast, Rabin showed in 1972 an Ω(n) bound for the deterministic case. We point out that their tec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999